Root number in integer parameter families of elliptic curves
نویسندگان
چکیده
In a previous article [7], the author proves that value of root number varies in non-isotrivial family elliptic curves indexed by one parameter t running through $${\mathbb {Q}}$$ . However, well-known example Washington has $$-1$$ for every fiber when runs {Z}}$$ Such examples are rare since, as proven this paper, integer fibers large class families curves. This result depends on squarefree conjecture and Chowla’s conjecture, is unconditional many cases.
منابع مشابه
Integer points on two families of elliptic curves
In this paper we find all the integer points on elliptic curves induced by the Diophantine triples {k − 1, k + 1, 16k − 4k} and {k − 1, k + 1, 64k− 48k + 8k} that have either rank two or 2 ≤ k ≤ 10000 (with one possible exception).
متن کاملAverage Root Numbers in Families of Elliptic Curves
We introduce a height measure on Q to count rational numbers. Through it, we prove a density result on the average value of the root numbers of families of twists of elliptic curves. Zagier and Kramarz computed in [11] the rank of the curves x + y = m, with m an integer < 70, 000. These data suggest that the rank is even for exactly half of the twists of x + y = 1. This conjecture has been prov...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملSome integer factorization algorithms using elliptic curves
Lenstra’s integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase. Under some plausible assumptions, the speedup is of order ln(p), where p is the factor which is found. In practice the speedup is significant. We mention some ...
متن کاملS-integer Points on Elliptic Curves
We give a quantitative bound for the number of S-integral points on an elliptic curve over a number field K in terms of the number of primes dividing the denominator of the j-invariant, the degree [K : Q], and the number of primes in S. Let K be a number field of degree d and MK the set of places of K. Let E/K be an elliptic curve with quasi-minimal Weierstrass equation E : y = x +Ax+B. If ∆ = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Mathématiques Du Québec
سال: 2021
ISSN: ['2195-4755', '2195-4763']
DOI: https://doi.org/10.1007/s40316-021-00164-8